Probability and computing - randomized algorithms and probabilistic analysis

نویسندگان

Michael Mitzenmacher

Eli Upfal

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysing Randomized Distributed Algorithms

Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, message routing and cache management. The appeal of randomized algorithms is their simplicity and elegance. However, this comes at a cost: the analysis of such systems become very complex, particularly in the context of distrib...

متن کامل

Fast Universal Algorithms for Robustness Analysis

In this paper, we develop efficient randomized algorithms for estimating probabilistic robustness margin and constructing robustness degradation curve for uncertain dynamic systems. One remarkable feature of these algorithms is their universal applicability to robustness analysis problems with arbitrary robustness requirements and uncertainty bounding set. In contrast to existing probabilistic ...

متن کامل

INTERVAL ANALYSIS-BASED HYPERBOX GRANULAR COMPUTING CLASSIFICATION ALGORITHMS

Representation of a granule, relation and operation between two granules are mainly researched in granular computing. Hyperbox granular computing classification algorithms (HBGrC) are proposed based on interval analysis. Firstly, a granule is represented as the hyperbox which is the Cartesian product of $N$ intervals for classification in the $N$-dimensional space. Secondly, the relation betwee...

متن کامل

Probabilistic Construction and Analysis of Seminormalized Hadamard Matrices

Let ~o be a 4k-length column vector whose all entries are 1s, with k a positive integer. Let V = {~vi} be a set of semi-normalized Hadamard (SH)-vectors, which are 4k-length vectors whose 2k entries are −1s and the remaining 2k are 1s. We define a 4k-order QSH (Quasi SH)-matrix, ~ Q, as a 4k × 4k matrix where the first column is ~o and the remaining ones are distinct ~vi ∈ V . When ~ Q is ortho...

متن کامل